Backward Path Following Under a Strong Headwind for UAV
نویسندگان
چکیده
منابع مشابه
Backward and forward path following control of a wheeled robot
A wheeled mobile robot is one of the most important types of mobile robots. A subcategory of these robots is wheeled robots towing trailer(s). Motion control problem, especially in backward motion is one of the challenging research topics in this field. In this article, a control algorithm for path-following problem of a tractor-trailer system is provided, which at the same time provides the ab...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملParallel Evolutionary Algorithms for Uav Path Planning
Evolutionary computation (EC) techniques have been successfully applied to compute near-optimal paths for unmanned aerial vehicles (UAVs). Premature convergence prevents evolutionary-based algorithms from reaching global optimal solutions. This often leads to unsatisfactory routes that are suboptimal to optimal path planning problems. To overcome this problem, this paper presents a framework of...
متن کاملPath-Sensitive Backward Slicing
Backward slicers are typically path-insensitive (i.e., they ignore the evaluation of predicates at conditional branches) often producing too big slices. Though the effect of path-sensitivity is always desirable, the major challenge is that there are, in general, an exponential number of predicates to be considered. We present a path-sensitive backward slicer and demonstrate its practicality wit...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Society for Aeronautical & Space Sciences
سال: 2014
ISSN: 1225-1348
DOI: 10.5139/jksas.2014.42.5.376